51f5955c5712b5a5d2ad90d7234056d96d89ead7,src/main/java/org/highj/data/impl/treeMap/Node.java,Node,deleteGT,#Ord#K#,327
Before Change
if (!isEmpty() && left.color == RED) {
Node<K, V> newRight = new Node<>(RED, bHeight, key, value, left.right, right).delete_(ord, k);
return balanceR(color, bHeight, left.key, left.value, left.left, newRight);
} else if (!isEmpty() && color == RED) {
if (right.isBlackLeftBlack()) {
if (left.isBlackLeftRed()) {
Node<K, V> newRightRight = right.turn(RED).delete_(ord, k);
Node<K, V> newRight = balanceR(BLACK, left.bHeight, key, value, left.right, newRightRight);
return new Node<>(RED, bHeight, left.key, left.value, left.left.turn(BLACK), newRight);
}
Node<K, V> newRight = right.turn(RED).delete_(ord, k);
return balanceR(BLACK, bHeight - 1, key, value, left.turn(RED), newRight);
}
return new Node<>(RED, bHeight, key, value, left, right.delete_(ord, k));
}
throw new AssertionError("deleteGT");
}
After Change
Node<K, V> newRight = right.turn(RED).delete_(ord, k);
return balanceR(BLACK, bHeight - 1, key, value, left.turn(RED), newRight);
}
return red(bHeight, key, value, left, right.delete_(ord, k));
}
throw new AssertionError("deleteGT");
}